An Exact Cooperative Method for Solving the 0-1 Multidimensional Knapsack Problem
نویسندگان
چکیده
This article presents an exact cooperative method for solving the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. The first step of our algorithm tries to find out a good feasible solution of the (MKP ) using surrogate relaxation. For this purpose, we have developed a modified dynamic programming algorithm. The second step is based on a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Solutions obtained with the first step are compared with results provided by other existing heuristics, finally our method is compared with a branch and bound algorithm.
منابع مشابه
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0–1 Multidimensional Knapsack Problem. This algorithm is able to prove large–scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
متن کاملSolution of Multidimensional Knapsack Problem via Cooperation of Dynamic Programming and Branch and Bound
This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Sol...
متن کاملSolution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound
Abstract: This article presents an exact cooperative method for the solution of the multidimensional knapsack problem ( ) MKP which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the lite...
متن کاملImproved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems
The 0–1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in space to represent the position of fish in the school. In this paper, a binary version of the artific...
متن کاملOverview of the Algorithms for Solving the Multidimensional Knapsack Problems
The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate i...
متن کامل